Search results for "finite [mass]"

showing 10 items of 356 documents

A primal-dual algorithm for the fermat-weber problem involving mixed gauges

1987

We give a new algorithm for solving the Fermat-Weber location problem involving mixed gauges. This algorithm, which is derived from the partial inverse method developed by J.E. Spingarn, simultaneously generates two sequences globally converging to a primal and a dual solution respectively. In addition, the updating formulae are very simple; a stopping rule can be defined though the method is not dual feasible and the entire set of optimal locations can be obtained from the dual solution by making use of optimality conditions. When polyhedral gauges are used, we show that the algorithm terminates in a finite number of steps, provided that the set of optimal locations has nonepty interior an…

Set (abstract data type)Fermat's Last TheoremMathematical optimizationSimple (abstract algebra)General MathematicsNumerical analysisApplied mathematicsWeber problemFinite setSoftwareCounterexampleDual (category theory)MathematicsMathematical Programming
researchProduct

Method of changing the operation of wireless network nodes

2013

Settore ING-INF/03 - Telecomunicazioniwireless network node MAC protocol finite state machine
researchProduct

Il nome nel testo, col pretesto di Lessico Famigliare di Natalia Ginzburg

2018

Natalia Ginzburg’s Lessico famigliare contains a remarkable number of proper nouns. In the course of the novel, the «general meaning» of the proper noun plays an important functional role. This paper will show how one particular feature of the syntax of proper nouns – their combination with the definite article – has a precise textual value.

Settore L-FIL-LET/09 - Filologia E Linguistica RomanzaLessico famigliaredefinite articleproper nountextual onomastic
researchProduct

Quantification and visualization of finite strain in 3D viscous numerical models of folding and overthrusting

2020

Abstract Finite strain analysis and three-dimensional (3D) numerical modeling are important methods to understand the deformation history of rocks. Here, we analyze finite strain in 3D numerical simulations of power-law viscous folding and overthrusting. Simulations with different and laterally varying detachment geometries cause a lateral transition from folding (for thicker detachments) to overthrusting. We compute the 3D finite strain tensor, the principal strain values and their orientations. We compute the Nadai strain, e S , and the Lode’s ratio, ν , representing the strain symmetry (constriction or flattening). We apply Hsu diagrams to visualize strain distribution in e S - ν space, …

Shearing (physics)010504 meteorology & atmospheric sciencesGeologyGeometry3d modelNumerical models010502 geochemistry & geophysics01 natural sciencesFlatteningVisualizationCondensed Matter::Materials ScienceStrain distributionFinite strain theoryPolarGeology0105 earth and related environmental sciencesJournal of Structural Geology
researchProduct

Volume strain, strain type and flow path in a narrow shear zone

1998

This study explores the state of finite strain and changes in the mean kinematic vorticity number, grain size, whole-rock chemistry and mineralogy across an upper amphibolite-facies shear zone in a metadiorite, northern Malawi, east-central Africa. P–T conditions during shear-zone formation and deformation were approximately 700–750 °C and 5–7 kbar and are slightly less than P–T conditions for the regional peak of metamorphism. The major rock-forming minerals, plagioclase, hornblende, biotite, and quartz, were deformed by crystal-plastic processes accompanied by, except for hornblende, dynamic recrystallization. The modal abundance of all four major rock-forming minerals shows no systematic…

Simple shearFinite strain theoryengineeringDynamic recrystallizationGeneral Earth and Planetary SciencesPlagioclaseMineralogyengineering.materialShear zoneDeformation (engineering)GeologyHornblendeMyloniteGeologische Rundschau
researchProduct

Solution-mass-transfer deformation adjacent to the Glarus Thrust, with implications for the tectonic evolution of the Alpine wedge in eastern Switzer…

2001

Abstract We have studied aspects of absolute finite strain of sandstones and the deformation history above and below the Glarus Thrust in eastern Switzerland. The dominant deformation mechanism is solution mass transfer (SMT), which resulted in the formation of a semi-penetrative cleavage. Our analysis indicates that the Verrucano and Melser sandstones, which lie above the thrust, were deformed coaxially, with pronounced contraction in a subvertical Z direction and minor extension in a subhorizontal X direction, trending at ∼200°. Most of the contraction in Z was balanced by mass-loss volume strains, averaging ∼36%. Below the Glarus Thrust, sandstones of the North Helvetic flysch have small…

Simple shearFlyschDeformation mechanismFinite strain theoryCleavage (geology)GeologyThrustHelvetic nappesPetrologyWedge (geometry)SeismologyGeologyJournal of Structural Geology
researchProduct

Quantum counter automata

2011

The question of whether quantum real-time one-counter automata (rtQ1CAs) can outperform their probabilistic counterparts has been open for more than a decade. We provide an affirmative answer to this question, by demonstrating a non-context-free language that can be recognized with perfect soundness by a rtQ1CA. This is the first demonstration of the superiority of a quantum model to the corresponding classical one in the real-time case with an error bound less than 1. We also introduce a generalization of the rtQ1CA, the quantum one-way one-counter automaton (1Q1CA), and show that they too are superior to the corresponding family of probabilistic machines. For this purpose, we provide gene…

SoundnessFOS: Computer and information sciencesQuantum PhysicsGeneralizationComputer scienceProbabilistic logicFOS: Physical sciences0102 computer and information sciences02 engineering and technologyComputational Complexity (cs.CC)01 natural sciencesAutomatonAlgebraComputer Science - Computational Complexity010201 computation theory & mathematics0202 electrical engineering electronic engineering information engineeringComputer Science (miscellaneous)Quantum finite automata020201 artificial intelligence & image processingPoint (geometry)Quantum Physics (quant-ph)Quantum
researchProduct

Special factors and the combinatorics of suffix and factor automata

2011

AbstractThe suffix automaton (resp. factor automaton) of a finite word w is the minimal deterministic automaton recognizing the set of suffixes (resp. factors) of w. We study the relationships between the structure of the suffix and factor automata and classical combinatorial parameters related to the special factors of w. We derive formulae for the number of states of these automata. We also characterize the languages LSA and LFA of words having respectively suffix automaton and factor automaton with the minimal possible number of states.

Special factorGeneral Computer ScienceSpecial factorsFactor automatonBüchi automatonω-automatonTheoretical Computer ScienceCombinatoricsDeterministic automatonTwo-way deterministic finite automatonNondeterministic finite automatonComputer Science::Data Structures and AlgorithmsCombinatorics on wordStandard Sturmian wordsMathematicsDiscrete mathematicsCombinatorics on wordsDAWGPushdown automatonComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Nonlinear Sciences::Cellular Automata and Lattice GasesSuffix automatonProbabilistic automatonSuffix automatonComputer Science::Formal Languages and Automata TheoryComputer Science(all)Theoretical Computer Science
researchProduct

Unary Probabilistic and Quantum Automata on Promise Problems

2015

We continue the systematic investigation of probabilistic and quantum finite automata (PFAs and QFAs) on promise problems by focusing on unary languages. We show that bounded-error QFAs are more powerful than PFAs. But, in contrary to the binary problems, the computational powers of Las-Vegas QFAs and bounded-error PFAs are equivalent to deterministic finite automata (DFAs). Lastly, we present a new family of unary promise problems with two parameters such that when fixing one parameter QFAs can be exponentially more succinct than PFAs and when fixing the other parameter PFAs can be exponentially more succinct than DFAs.

State-transition matrixDiscrete mathematicsDeterministic finite automatonUnary operationMarkov chainUnary languageProbabilistic logicQuantum finite automataBinary numberComputer Science::Computational ComplexityComputer Science::Formal Languages and Automata TheoryMathematics
researchProduct

Disorder relevance for the random walk pinning model in dimension 3

2011

We study the continuous time version of the random walk pinning model, where conditioned on a continuous time random walk Y on Z^d with jump rate \rho>0, which plays the role of disorder, the law up to time t of a second independent random walk X with jump rate 1 is Gibbs transformed with weight e^{\beta L_t(X,Y)}, where L_t(X,Y) is the collision local time between X and Y up to time t. As the inverse temperature \beta varies, the model undergoes a localization-delocalization transition at some critical \beta_c>=0. A natural question is whether or not there is disorder relevance, namely whether or not \beta_c differs from the critical point \beta_c^{ann} for the annealed model. In Birkner a…

Statistics and Probability60K35 82B4482B44Probability (math.PR)Random mediaGeometryMarginal disorderFractional moment methodMean estimationMathematics::Probability60K35Local limit theoremFOS: MathematicsCollision local timeDisordered pinning modelsStatistics Probability and UncertaintyRandom walksHumanitiesRenewal processes with infinite meanMathematics - ProbabilityMathematicsAnnales de l'Institut Henri Poincaré, Probabilités et Statistiques
researchProduct